A General Rank-2 Parameterization of the Fundamental Matrix
نویسندگان
چکیده
All the methods for estimating the fundamental matrix do not naturally exploit the rank-2 constraint. For these reason some few rank-2 parameterizations of the fundamental matrix have been proposed over the years. In general they can be or an over-parameterization (12 parameters) and being generally valid, or use a minimal set of parameters (eight) but do not cover all the rank-2 matrices. We propose a new rank-2 parameterization which uses only 9 parameters, one more of the minimal parameterizations, and covers all the rank-2 matrices.
منابع مشابه
A Combined RANSAC-Hough Transform Algorithm for Fundamental Matrix Estimation
In this paper we will consider a combination of the RANSAC algorithm and the Hough transform for fast model estimation under the presence of outliers. The model will be computed by sampling a smaller than minimal subset, followed by a voting process of the remaining data. In order to use the combined method for this purpose, an adequate parameterization of the model in the Hough space is requir...
متن کاملThe Global Optimization Geometry of Low-Rank Matrix Optimization
In this paper we characterize the optimization geometry of a matrix factorization problem where we aim to find n×r and m×r matrices U and V such that UV T approximates a given matrixX. We show that the objective function of the matrix factorization problem has no spurious local minima and obeys the strict saddle property not only for the exact-parameterization case where rank(X) = r, but also f...
متن کاملThe geometry of weighted low-rank approximations
The low-rank approximation problem is to approximate optimally, with respect to some norm, a matrix by one of the same dimension but smaller rank. It is known that under the Frobenius norm, the best low-rank approximation can be found by using the singular value decomposition (SVD). Although this is no longer true under weighted norms in general, it is demonstrated here that the weighted low-ra...
متن کاملUnifying Two-View and Three-View Geometry
The core of multiple-view geometry is governed by the fundamental matrix and the trilinear tensor. In this paper we unify both representations by rst deriving the fundamental matrix as a rank-2 trivalent tensor, and secondly by deriving a uniied set of operators that are transparent to the number of views. As a result, we show that the basic building block of the geometry of multiple views is a...
متن کاملHigher rank numerical ranges of rectangular matrix polynomials
In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000